A fast and #exible multiresolution snake with a de"nite termination criterion

نویسندگان

  • Nilanjan Ray
  • Bhabatosh Chanda
  • Jyotirmay Das
چکیده

This paper describes a fast process of parametric snake evolution with a multiresolution strategy. Conventional parametric evolution method relies on matrix inversion throughout the iteration intermittently, in contrast the proposed method relaxes the matrix inversion which is costly and time consuming in cases where the resulting snake is #exible. The proposed method also eliminates the input of snake rigidity parameters when the snake is #exible. Also, a robust and de"nite termination criterion for both conventional and proposed methods is demonstrated in this paper. 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fast and flexible multiresolution snake with a definite termination criterion

This paper describes a fast process of parametric snake evolution with a multiresolution strategy. Conventional parametric evolution method relies on matrix inversion throughout the iteration intermittently, in contrast the proposed method relaxes the matrix inversion which is costly and time consuming in cases where the resulting snake is exible. The proposed method also eliminates the input o...

متن کامل

ALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS

Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...

متن کامل

Multiresolution on compact groups

Given a compact group M, we de®ne the notion of multiresolution of L2…M† with respect to an in®nite sequence of subgroups G0 G1 G2 such that G ˆ [kˆ0Gk is a dense subgroup of M. We give characterizations of various axioms of multiresolution, demonstrate the existence and give the construction of a wavelet basis for L2…M†. We also construct stationary multiresolution and wavelets from cyclic vec...

متن کامل

On the Graphs Related to Green Relations of Finite Semigroups

In this paper we develop an analog of the notion of the con- jugacy graph of  nite groups for the  nite semigroups by considering the Green relations of a  nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a  nite semigroup S , we  first atte...

متن کامل

Dynamical ‎C‎ontrol of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear ‎Equations

One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001